On the Number of Iterations for Dantzig-Wolfe Optimization and Pa king-Covering Approximation Algorithms
نویسنده
چکیده
منابع مشابه
On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms
We start with definitions given by Plotkin, Shmoys, and Tardos [16]. Given A ∈ IR, b ∈ IR and a polytope P ⊆ IR, the fractional packing problem is to find an x ∈ P such that Ax ≤ b if such an x exists. An -approximate solution to this problem is an x ∈ P such that Ax ≤ (1 + )b. An -relaxed decision procedure always finds an -approximate solution if an exact solution exists. A Dantzig-Wolfe-type...
متن کاملAlgorithms for Implementing Fair Wireless Power Allocations
We describe algorithms for fairly allocating power among wireless devices sharing a multiple access channel. This problem can be formulated as one of finding a representation of a point in a contra-polymatroid as a convex combination of a small number of its extreme points. We show that this problem is solvable in polynomial time and then describe a fast algorithms based on the Dantzig-Wolfe de...
متن کاملSimplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints
The simplicial decomposition (SD) subproblem for a nonlinear multicommodity network ow problem is simply its linear approximation. Instead of solving the subproblem optimally, this paper demonstrates that performing one iteration of Dantzig– Wolfe decomposition is generally su cient for SD to e ciently converge to an optimal solution. c © 2000 Elsevier Science B.V. All rights reserved.
متن کاملBenson's algorithm for nonconvex multiobjective problems via nonsmooth Wolfe duality
In this paper, we propose an algorithm to obtain an approximation set of the (weakly) nondominated points of nonsmooth multiobjective optimization problems with equality and inequality constraints. We use an extension of the Wolfe duality to construct the separating hyperplane in Benson's outer algorithm for multiobjective programming problems with subdifferentiable functions. We also fo...
متن کاملDistributed Anytime MAP Inference
We present a distributed anytime algorithm for performing MAP inference in graphical models. The problem is formulated as a linear programming relaxation over the edges of a graph. The resulting program has a constraint structure that allows application of the Dantzig-Wolfe decomposition principle. Subprograms are defined over individual edges and can be computed in a distributed manner. This a...
متن کامل